Concurrency in the Data Warehouse

نویسنده

  • Richard Taylor
چکیده

When a data warehouse is loaded at night and queried during the day, there is no requirement for concurrent update and querying. However there are a number of situations where concurrency is needed: trickle feed applications, correcting exception data from the nightly load, the narrowing load window. The end point of the narrowing load window is a data warehouse that is available 7x24. Query Priority Concurrency is the concurrency mechanism implemented by the Informix Red Brick Decision Server. It is called Query Priority Concurrency because it uses versioning to achieve the goal that query performance is unaffected by concurrent loads. The paper discusses the differing requirements for concurrency in a data warehouse, explains why versioning is appropriate, gives a sketch of the implementation and discusses the 6 lock modes that are needed to achieve concurrency and serialised execution. Finally, the frozen query feature is described. This allows users to query the current published version of the data warehouse while the administrators go through all the steps of loading and verifying new data to create the next issue of the warehouse for publication.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting Versions for On-line Data Warehouse Maintenance in MOLAP Servers

A data warehouse is an integrated database whose data is collected from several data sources, and supports on-line analytical processing (OLAP). Typically, a query to the data warehouse tends to be complex and involves a large volume of data. To keep the data at the warehouse consistent with the source data, changes to the data sources should be propagated to the data warehouse periodically. Be...

متن کامل

Self-maintainable Data Warehouse Views Using Differential Files

Data warehouses materialize views in order to provide fast access to information, but the correctness also should be maintained. The notion of selfmaintenance can be a goal that defined as maintaining views by materializing supplementary data. Incremental update mechanisms can now be prospective way to the goal. A discussion with extensive literature is generated on several issues with maintain...

متن کامل

On-Line Warehouse View Maintenance for Batch Updates

Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodically by maintenance transactions, which propagate large batch updates from the base tables. In current warehousing systems, maintenance transactions usually are isolated from client read activity, limiting availability a...

متن کامل

Parallelizing SPECjbb2000 with Transactional Memory

As chip-multiprocessors become ubiquitous, it is critical to provide architectural support for practical parallel programming. Transactional Memory (TM) [4] has the potential to simplify concurrency management by supporting parallel tasks (transactions) that appear to execute atomically and in isolation. By virtue of optimistic concurrency, transactional memory promises good parallel performanc...

متن کامل

The SDCC Framework for Integrating Existing Algorithms for Diverse Data Warehouse Maintenance Tasks

Recently proposed view maintenance algorithms tackle the problem of concurrent data updates happening at diierent autonomous ISs, whereas the EVE system addresses the maintenance of a data warehouse after schema changes of ISs. The concurrency of schema changes and data updates still remains an unexplored problem however. This paper now provides a rst solution that guarantees concurrent view de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000